A Server-Aided Computation Protocol Revisited for Confidentiality of Cloud Service

نویسندگان

  • Yoshiaki Shiraishi
  • Masami Mohri
  • Youji Fukuta
چکیده

In cloud-computing services, using the SSL/TLS protocol is not enough to ensure data confidentiality. For instance, cloud service providers can see the plaintext after the decryption at the end point of a secure channel. It is wise to introduce an encryption layer between the service client and the communication channel so the data will not be seen by the cloud service provider. The encryption/decryption process should be light for cases where a cloud-service user has a low-power device such as a smart phone. We pay attention to server-aided computation as an approach of speeding up cryptographic processing. On the other hand, for future cloud services, homomorphic encryption is a useful primitive for cryptographic protocols. In this paper, we propose a server-aided computation protocol using ElGamal encryption, which is homomorphic. The proposed protocol is secure under the discrete logarithm assumption for passive and active attacks. Furthermore, we present experimental results suggesting that the processing time of the proposed protocol is shorter than the original ElGamal encryption.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation on Randomized Data

Cryptographic tools, such as secure computation or homomorphic encryption, are very computationally expensive. This makes their use for confidentiality protection of client’s data against an untrusted service provider uneconomical in most applications of cloud computing. In this paper we present techniques for randomizing data using light-weight operations and then securely outsourcing the comp...

متن کامل

DupLESS: Server-Aided Encryption for Deduplicated Storage

Cloud storage service providers such as Dropbox, Mozy, and others perform deduplication to save space by only storing one copy of each file uploaded. Should clients conventionally encrypt their files, however, savings are lost. Message-locked encryption (the most prominent manifestation of which is convergent encryption) resolves this tension. However it is inherently subject to brute-force att...

متن کامل

An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things

Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...

متن کامل

Fuzzy retrieval of encrypted data by multi-purpose data-structures

The growing amount of information that has arisen from emerging technologies has caused organizations to face challenges in maintaining and managing their information. Expanding hardware, human resources, outsourcing data management, and maintenance an external organization in the form of cloud storage services, are two common approaches to overcome these challenges; The first approach costs of...

متن کامل

Digital Forensics Evidence Acquisition and Chain of Custody in Cloud Computing

The new cloud computing concept delivers an adaptable service to many users. This is due to the fact that cloud computing offers an economic solution based on pay-per use idea. At the same time, digital forensics is a relatively new discipline born out due to the growing use of computing and digital solution. Digital forensics in cloud computing brings new technical and legal challenges (e.g. t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JoWUA

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2011